0.10/0.12	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.10/0.12	% Command    : run_E %s %d THM
0.12/0.32	% Computer : n008.cluster.edu
0.12/0.32	% Model    : x86_64 x86_64
0.12/0.32	% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.12/0.32	% Memory   : 8042.1875MB
0.12/0.32	% OS       : Linux 3.10.0-693.el7.x86_64
0.12/0.33	% CPULimit   : 1440
0.12/0.33	% WCLimit    : 180
0.12/0.33	% DateTime   : Thu Jul  4 06:24:54 EDT 2024
0.12/0.33	% CPUTime    : 
0.20/0.47	Running higher-order theorem proving
0.20/0.47	Running: /export/starexec/sandbox/solver/bin/eprover-ho --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=180 /export/starexec/sandbox/tmp/tmp.ZrNxBCIXiP/E---3.1_26529.p
0.20/0.49	# Version: 3.2.0-ho
0.20/0.49	# Preprocessing class: HSSSSMSSSSSNFFN.
0.20/0.49	# Scheduled 4 strats onto 8 cores with 180 seconds (1440 total)
0.20/0.49	# Starting new_ho_10 with 900s (5) cores
0.20/0.49	# Starting ho_unfolding_6 with 180s (1) cores
0.20/0.49	# Starting sh4l with 180s (1) cores
0.20/0.49	# Starting ehoh_best_nonlift_rwall with 180s (1) cores
0.20/0.49	# ho_unfolding_6 with pid 26682 completed with status 0
0.20/0.49	# Result found by ho_unfolding_6
0.20/0.49	# Preprocessing class: HSSSSMSSSSSNFFN.
0.20/0.49	# Scheduled 4 strats onto 8 cores with 180 seconds (1440 total)
0.20/0.49	# Starting new_ho_10 with 900s (5) cores
0.20/0.49	# Starting ho_unfolding_6 with 180s (1) cores
0.20/0.49	# No SInE strategy applied
0.20/0.49	# Search class: HHUNS-FFSF21-MFFFFFNN
0.20/0.49	# Scheduled 6 strats onto 1 cores with 180 seconds (180 total)
0.20/0.49	# Starting new_ho_10 with 98s (1) cores
0.20/0.49	# new_ho_10 with pid 26687 completed with status 0
0.20/0.49	# Result found by new_ho_10
0.20/0.49	# Preprocessing class: HSSSSMSSSSSNFFN.
0.20/0.49	# Scheduled 4 strats onto 8 cores with 180 seconds (1440 total)
0.20/0.49	# Starting new_ho_10 with 900s (5) cores
0.20/0.49	# Starting ho_unfolding_6 with 180s (1) cores
0.20/0.49	# No SInE strategy applied
0.20/0.49	# Search class: HHUNS-FFSF21-MFFFFFNN
0.20/0.49	# Scheduled 6 strats onto 1 cores with 180 seconds (180 total)
0.20/0.49	# Starting new_ho_10 with 98s (1) cores
0.20/0.49	# Preprocessing time       : 0.001 s
0.20/0.49	# Presaturation interreduction done
0.20/0.49	
0.20/0.49	# Proof found!
0.20/0.49	# SZS status Theorem
0.20/0.49	# SZS output start CNFRefutation
0.20/0.49	thf(decl_22, type, nt: $i > $i).
0.20/0.49	thf(decl_23, type, imp: $i > $i > $i).
0.20/0.49	thf(decl_24, type, cT: $i > $o).
0.20/0.49	thf(decl_25, type, esk1_0: $i).
0.20/0.49	thf(cLCL077_1, conjecture, ~(((((![X1:$i, X2:$i]:((cT @ (imp @ X1 @ (imp @ X2 @ X1))))&?[X3:$i]:(~((cT @ (imp @ (nt @ (nt @ X3)) @ X3)))))&![X1:$i, X2:$i]:((cT @ (imp @ (imp @ (nt @ X1) @ (nt @ X2)) @ (imp @ X2 @ X1)))))&![X1:$i, X2:$i, X4:$i]:((cT @ (imp @ (imp @ X1 @ (imp @ X2 @ X4)) @ (imp @ (imp @ X1 @ X2) @ (imp @ X1 @ X4))))))&![X1:$i, X2:$i]:((~((cT @ (imp @ X1 @ X2)))|(cT @ X2)|~((cT @ X1)))))), file('/export/starexec/sandbox/tmp/tmp.ZrNxBCIXiP/E---3.1_26529.p', cLCL077_1)).
0.20/0.49	thf(c_0_1, negated_conjecture, ~(~(((((![X1:$i, X2:$i]:((cT @ (imp @ X1 @ (imp @ X2 @ X1))))&?[X3:$i]:(~(cT @ (imp @ (nt @ (nt @ X3)) @ X3))))&![X1:$i, X2:$i]:((cT @ (imp @ (imp @ (nt @ X1) @ (nt @ X2)) @ (imp @ X2 @ X1)))))&![X1:$i, X2:$i, X4:$i]:((cT @ (imp @ (imp @ X1 @ (imp @ X2 @ X4)) @ (imp @ (imp @ X1 @ X2) @ (imp @ X1 @ X4))))))&![X1:$i, X2:$i]:((~(cT @ (imp @ X1 @ X2))|(cT @ X2)|~(cT @ X1)))))), inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[cLCL077_1])])).
0.20/0.49	thf(c_0_2, negated_conjecture, ![X15:$i, X16:$i, X18:$i, X19:$i, X20:$i, X21:$i, X22:$i, X23:$i, X24:$i]:((((((cT @ (imp @ X15 @ (imp @ X16 @ X15)))&~(cT @ (imp @ (nt @ (nt @ esk1_0)) @ esk1_0)))&(cT @ (imp @ (imp @ (nt @ X18) @ (nt @ X19)) @ (imp @ X19 @ X18))))&(cT @ (imp @ (imp @ X20 @ (imp @ X21 @ X22)) @ (imp @ (imp @ X20 @ X21) @ (imp @ X20 @ X22)))))&(~(cT @ (imp @ X23 @ X24))|(cT @ X24)|~(cT @ X23)))), inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_1])])])])])).
0.20/0.49	thf(c_0_3, negated_conjecture, ![X2:$i, X1:$i]:(((cT @ X2)|~((cT @ (imp @ X1 @ X2)))|~((cT @ X1)))), inference(split_conjunct,[status(thm)],[c_0_2])).
0.20/0.49	thf(c_0_4, negated_conjecture, ![X1:$i, X2:$i, X3:$i]:((cT @ (imp @ (imp @ X1 @ (imp @ X2 @ X3)) @ (imp @ (imp @ X1 @ X2) @ (imp @ X1 @ X3))))), inference(split_conjunct,[status(thm)],[c_0_2])).
0.20/0.49	thf(c_0_5, negated_conjecture, ![X1:$i, X2:$i, X3:$i]:(((cT @ (imp @ (imp @ X1 @ X2) @ (imp @ X1 @ X3)))|~((cT @ (imp @ X1 @ (imp @ X2 @ X3)))))), inference(spm,[status(thm)],[c_0_3, c_0_4])).
0.20/0.49	thf(c_0_6, negated_conjecture, ![X2:$i, X1:$i]:((cT @ (imp @ X1 @ (imp @ X2 @ X1)))), inference(split_conjunct,[status(thm)],[c_0_2])).
0.20/0.49	thf(c_0_7, negated_conjecture, ![X1:$i, X2:$i, X3:$i]:(((cT @ (imp @ X1 @ X2))|~((cT @ (imp @ X1 @ (imp @ X3 @ X2))))|~((cT @ (imp @ X1 @ X3))))), inference(spm,[status(thm)],[c_0_3, c_0_5])).
0.20/0.49	thf(c_0_8, negated_conjecture, ![X1:$i, X2:$i]:(((cT @ (imp @ X1 @ X2))|~((cT @ X2)))), inference(spm,[status(thm)],[c_0_3, c_0_6])).
0.20/0.49	thf(c_0_9, negated_conjecture, ![X1:$i, X3:$i, X2:$i]:(((cT @ (imp @ X1 @ X2))|~((cT @ (imp @ X1 @ X3)))|~((cT @ (imp @ X3 @ X2))))), inference(spm,[status(thm)],[c_0_7, c_0_8])).
0.20/0.49	thf(c_0_10, negated_conjecture, ![X2:$i, X1:$i]:((cT @ (imp @ (imp @ (nt @ X1) @ (nt @ X2)) @ (imp @ X2 @ X1)))), inference(split_conjunct,[status(thm)],[c_0_2])).
0.20/0.49	thf(c_0_11, negated_conjecture, ![X1:$i, X3:$i, X2:$i]:(((cT @ (imp @ X1 @ X2))|~((cT @ (imp @ (imp @ X3 @ X1) @ X2))))), inference(spm,[status(thm)],[c_0_9, c_0_6])).
0.20/0.49	thf(c_0_12, negated_conjecture, ![X1:$i, X2:$i, X3:$i]:(((cT @ (imp @ (imp @ (nt @ X1) @ (nt @ X2)) @ X3))|~((cT @ (imp @ (imp @ X2 @ X1) @ X3))))), inference(spm,[status(thm)],[c_0_9, c_0_10])).
0.20/0.49	thf(c_0_13, negated_conjecture, ![X1:$i, X2:$i]:(((cT @ (imp @ (imp @ (nt @ X1) @ (nt @ X2)) @ X1))|~((cT @ (imp @ (imp @ (nt @ X1) @ (nt @ X2)) @ X2))))), inference(spm,[status(thm)],[c_0_7, c_0_10])).
0.20/0.49	thf(c_0_14, negated_conjecture, ![X1:$i, X3:$i, X2:$i]:(((cT @ (imp @ (nt @ X1) @ X2))|~((cT @ (imp @ (imp @ X1 @ X3) @ X2))))), inference(spm,[status(thm)],[c_0_11, c_0_12])).
0.20/0.49	thf(c_0_15, negated_conjecture, ![X1:$i, X2:$i]:(((cT @ (imp @ (imp @ (nt @ X1) @ (nt @ X2)) @ X1))|~((cT @ X2)))), inference(spm,[status(thm)],[c_0_13, c_0_8])).
0.20/0.49	thf(c_0_16, negated_conjecture, ![X1:$i, X2:$i]:(((cT @ (imp @ (nt @ (nt @ X1)) @ X1))|~((cT @ X2)))), inference(spm,[status(thm)],[c_0_14, c_0_15])).
0.20/0.49	thf(c_0_17, negated_conjecture, ~((cT @ (imp @ (nt @ (nt @ esk1_0)) @ esk1_0))), inference(split_conjunct,[status(thm)],[c_0_2])).
0.20/0.49	thf(c_0_18, negated_conjecture, ![X1:$i]:((cT @ (imp @ (nt @ (nt @ X1)) @ X1))), inference(spm,[status(thm)],[c_0_16, c_0_10])).
0.20/0.49	thf(c_0_19, negated_conjecture, ($false), inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_17, c_0_18])]), ['proof']).
0.20/0.49	# SZS output end CNFRefutation
0.20/0.49	# Parsed axioms                        : 4
0.20/0.49	# Removed by relevancy pruning/SinE    : 0
0.20/0.49	# Initial clauses                      : 8
0.20/0.49	# Removed in clause preprocessing      : 3
0.20/0.49	# Initial clauses in saturation        : 5
0.20/0.49	# Processed clauses                    : 62
0.20/0.49	# ...of these trivial                  : 0
0.20/0.49	# ...subsumed                          : 15
0.20/0.49	# ...remaining for further processing  : 47
0.20/0.49	# Other redundant clauses eliminated   : 0
0.20/0.49	# Clauses deleted for lack of memory   : 0
0.20/0.49	# Backward-subsumed                    : 0
0.20/0.49	# Backward-rewritten                   : 3
0.20/0.49	# Generated clauses                    : 175
0.20/0.49	# ...of the previous two non-redundant : 155
0.20/0.49	# ...aggressively subsumed             : 0
0.20/0.49	# Contextual simplify-reflections      : 0
0.20/0.49	# Paramodulations                      : 175
0.20/0.49	# Factorizations                       : 0
0.20/0.49	# NegExts                              : 0
0.20/0.49	# Equation resolutions                 : 0
0.20/0.49	# Disequality decompositions           : 0
0.20/0.49	# Total rewrite steps                  : 11
0.20/0.49	# ...of those cached                   : 5
0.20/0.49	# Propositional unsat checks           : 0
0.20/0.49	#    Propositional check models        : 0
0.20/0.49	#    Propositional check unsatisfiable : 0
0.20/0.49	#    Propositional clauses             : 0
0.20/0.49	#    Propositional clauses after purity: 0
0.20/0.49	#    Propositional unsat core size     : 0
0.20/0.49	#    Propositional preprocessing time  : 0.000
0.20/0.49	#    Propositional encoding time       : 0.000
0.20/0.49	#    Propositional solver time         : 0.000
0.20/0.49	#    Success case prop preproc time    : 0.000
0.20/0.49	#    Success case prop encoding time   : 0.000
0.20/0.49	#    Success case prop solver time     : 0.000
0.20/0.49	# Current number of processed clauses  : 39
0.20/0.49	#    Positive orientable unit clauses  : 6
0.20/0.49	#    Positive unorientable unit clauses: 0
0.20/0.49	#    Negative unit clauses             : 3
0.20/0.49	#    Non-unit-clauses                  : 30
0.20/0.49	# Current number of unprocessed clauses: 98
0.20/0.49	# ...number of literals in the above   : 220
0.20/0.49	# Current number of archived formulas  : 0
0.20/0.49	# Current number of archived clauses   : 8
0.20/0.49	# Clause-clause subsumption calls (NU) : 197
0.20/0.49	# Rec. Clause-clause subsumption calls : 197
0.20/0.49	# Non-unit clause-clause subsumptions  : 17
0.20/0.49	# Unit Clause-clause subsumption calls : 18
0.20/0.49	# Rewrite failures with RHS unbound    : 0
0.20/0.49	# BW rewrite match attempts            : 26
0.20/0.49	# BW rewrite match successes           : 3
0.20/0.49	# Condensation attempts                : 62
0.20/0.49	# Condensation successes               : 2
0.20/0.49	# Termbank termtop insertions          : 2937
0.20/0.49	# Search garbage collected termcells   : 100
0.20/0.49	
0.20/0.49	# -------------------------------------------------
0.20/0.49	# User time                : 0.007 s
0.20/0.49	# System time              : 0.004 s
0.20/0.49	# Total time               : 0.010 s
0.20/0.49	# Maximum resident set size: 1772 pages
0.20/0.49	
0.20/0.49	# -------------------------------------------------
0.20/0.49	# User time                : 0.007 s
0.20/0.49	# System time              : 0.007 s
0.20/0.49	# Total time               : 0.014 s
0.20/0.49	# Maximum resident set size: 1700 pages
0.20/0.49	% E---3.1 exiting
0.20/0.49	% E exiting
0.20/0.49	EOF